Single-change circular covering designs
نویسنده
چکیده
A single-change circular covering design (scccd) based on the set [v] = { 1 . . . . . t:} with block size k is an ordered collection o f b blocks, ~ = {Bi . . . . . B/,}, each B~ C [v], which obey: ( 1 ) each block differs from the previous block by a single element, as does the last from the first, and, (2) every pair of [v] is covered by some block. The object is to minimize b for a fixed v and k. We present some minimal constructions of scccds for arbitrary t: when k 2 and 3, and for arbitrary k when k + 1 ~2k; there are 2 non-isomorphic tight designs with (v, k ) (9, 4), and 12 with (v, k ) ( 1 0 , 4). Some non-existence results for tight designs, and standardized, element-regular, perfect, and column-regular designs are considered. @ 1999 Elsevier Science B.V. All rights reserved Ko'words." Single-change; Circular; Covering; Design; Tight 1. Definitions; notation; examples A single-change circular cover&9 design based on the set [v] {1 . . . . . v} with block size k is an ordered collect ion o f b blocks, .~ = {B1 . . . . . B~,}, each an unordered subset o f k distinct e lements from [v], which obey: (1) each block differs from the previous block by a single element, i.e., IBi l~qB, .1 = k 1 for i = 2 . . . . . b ; and the last block, B/,, differs from the first, BI, by a single element, i.e., IB/, f~Bll = k 1; (2) every (unordered) pair {x,y} of [v], with x ¢ y, can be writ ten as {ei,z} where eiCB~\Bi i and zEBi for some i = 2 . . . . . b, or as {e l ,z} where el ~B~\B/, and zCB~. * E-mail: [email protected]. / 0012-365X/99,$ see front matter @ 1999 Elsevier Science B.V. All rights reserved PII: S0012-365X(98)00263-5 562 J.P. McSorley l Discrete Mathematics 197/198 (1999) 561-588 element b locks introduced pairs covered Bi ei {ei, z}, z ~ Bi B1 6 4 2 6 {6, 4} {6, 2} B2 6 3 2 3 {3,6} {3,2} Ba 6 3 5 5 {5,6} {5,3} B4 631 1 {1,6} {1,3} B5 431 4 {4, 3} {4, 1} B6 451 5 {5, 4} {5, 1} B7 251 2 {2, 5} {2,1} Bs 241 4 {4, 2} {4,1} £, an economical scecd(6, 3, 8) 3)3, a tight 123 2 3 4 3 4 5 451 5 1 2
منابع مشابه
Single change neighbor designs
A singl~ change neighbor design SCN(v, k) is a way of selecting a sequence of cycles of length k from a complete graph on v vertices with the properties: any cycle is derived from the preceding one by changing one vertex; and every· edge is covered in at least one cycle. Some properties of these designs are investigated. In particular, designs with the smallest possible number of cycles are con...
متن کاملProblems from the Nineteenth British Combinatorial Conference
Most of these problems were presented at the problem session of the 19th British Combinatorial Conference at the University College of North Wales, Bangor, 29 June–4 July 2001. I have added some problems given to me after the session. As previously, the problems are circularly ordered; you may start at any point. Problem 1 (BCC19.1) Tight single-change covering designs. Proposed by D. A. Preece...
متن کاملMathematical Model for Bi-objective Maximal Hub Covering Problem with Periodic Variations of Parameters
The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure's parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In t...
متن کاملTemperature Effect on Vibration Analysis of Annular Graphene Sheet Embedded on Visco-Pasternak Foundati
In this study, the vibration behavior of circular and annular graphene sheet embedded in a Visco-Pasternak foundation and coupled with temperature change and under in-plane pre-load is studied. The single-layered annular graphene sheet is coupled by an enclosing viscoelastic medium which is simulated as a Visco- Pasternak foundation. By using the nonlocal elasticity theory and classical plate t...
متن کاملDynamic Hub Covering Problem with Flexible Covering Radius
Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 197-198 شماره
صفحات -
تاریخ انتشار 1999